Antichain Cutsets of Strongly Connected Posets

نویسندگان

  • Stephan Foldes
  • Russ Woodroofe
چکیده

Rival and Zaguia showed that the antichain cutsets of a finite Boolean lattice are exactly the level sets. We show that a similar characterization of antichain cutsets holds for any strongly connected poset of locally finite height. As a corollary, we characterize the antichain cutsets in semimodular lattices, supersolvable lattices, Bruhat orders, locally shellable lattices, and many more. We also consider a generalization to strongly connected d-uniform hypergraphs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matchings, cutsets, and chain partitions in graded posets

New properties that involve matchings, cutsets, or skipless chain partitions in graded posets are introduced and compared to familiar Sperner and chain partition properties. Related work is surveyed. We determine all possible combinations of these properties, with the exception of a long-standing open conjecture about L Y M posets, and provide a list of examples realizing these combinations.

متن کامل

On Antichains in Product Posets

A corollary of Hilbert’s basis theorem is that any antichain in the set of n-dimensional vectors with non-negative entries is finite. In other words, any antichain in the poset given by cartesian powers of semi-infinite chains is finite. We study several variations of this result. We provide necessary and sufficient conditions for antichains in the cartesian product of posets to be finite or bo...

متن کامل

A Note on Blockers in Posets

The blocker A∗ of an antichain A in a finite poset P is the set of elements minimal with the property of having with each member of A a common predecessor. The following is done: (1) The posets P for which A∗∗ = A for all antichains are characterized. (2) The blocker A∗ of a symmetric antichain in the partition lattice is characterized. (3) Connections with the question of finding minimal size ...

متن کامل

Stability and posets

Hirschfeldt and Shore have introduced a notion of stability for infinite posets. We define an arguably more natural notion called weak stability, and we study the existence of infinite computable or low chains or antichains, and of infinite Π1 chains and antichains, in infinite computable stable and weakly stable posets. For example, we extend a result of Hirschfeldt and Shore to show that ever...

متن کامل

Optimal Tree-Based One-Time Digital Signature Schemes

A minimal cutset of a tree directed from the leaves to the root is a minimal set of vertices such that every path from a leaf to the root meets at least one of these vertices. An order relation on the set of minmal cutsets can be deened: U V if and only if every vertex of U is on the path from some vertex in V to the root. Motivated by the design of eecient cryptographic digital signature schem...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Order

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2013